. M G ] 1 0 Ju n 20 05 ON PACKING SPHERES INTO CONTAINERS ( ABOUT KEPLER ’ S FINITE SPHERE PACKING PROBLEM )
نویسنده
چکیده
In Euclidean d-spaces, the container problem asks to pack n equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and d ≥ 2 we show that sequences of solutions to the container problem can not have a “simple structure”. By this we in particular find that there exist arbitrary small r > 0 such that packings with spheres of radius r into a smooth 3-dimensional convex body are necessarily not hexagonal close packings. This contradicts Kepler’s famous statement that the cubic or hexagonal close packing “will be the tightest possible, so that in no other arrangement more spheres could be packed into the same container”. AMS Mathematics Subject Classification 2000 (MSC2000): 52C17
منابع مشابه
9 S ep 2 00 6 ON PACKING SPHERES INTO CONTAINERS ( ABOUT KEPLER ’ S FINITE SPHERE PACKING PROBLEM )
In an Euclidean d-space, the container problem asks to pack n equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and d ≥ 2 we show that solutions to the container problem can not have a “simple structure” for large n. By this we in particular find that there exist arbitrary small r > 0, such that packings in a smooth, 3-dimensional convex ...
متن کاملOn Packing Spheres into Containers About Kepler ’ s Finite Sphere Packing Problem
In an Euclidean d-space, the container problem asks to pack n equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and d ≥ 2 we show that solutions to the container problem can not have a “simple structure” for large n. By this we in particular find that there exist arbitrary small r > 0, such that packings in a smooth, 3-dimensional convex ...
متن کاملA ug 2 00 0 Bounds for Local Density of Sphere Packings and the Kepler Conjecture Jeffrey
This paper formalizes the local density inequality approach to getting upper bounds for sphere packing densities in Rn. This approach was first suggested by L. Fejes-Tóth in 1954 as a method to prove the Kepler conjecture that the densest packing of unit spheres in R has density π √ 18 , which is attained by the “cannonball packing.” Local density inequalities give upper bounds for the sphere p...
متن کاملRecent Progress in Sphere Packing
The problem of nding the greatest density of any packing of equal spheres in n-dimensional Euclidean space is an old and important one, which has applications in geometry, number theory, and information theory. It is also di cult, as is shown by the fact that although the 3-dimensional case was raised by Kepler in 1613, it has only recently been solved, by Thomas Hales in 1998, with an importan...
متن کاملAn Overview of the Kepler Conjecture
A packing of spheres is an arrangement of nonoverlapping spheres of radius 1 in Euclidean space. Each sphere is determined by its center, so equivalently it is a collection of points in Euclidean space separated by distances of at least 2. The density of a packing is defined as the lim sup of the densities of the partial packings formed by spheres inside a ball with fixed center of radius R. (B...
متن کامل